Neuronal population model of globular bushy cells covering unit-to-unit variability
نویسندگان
چکیده
منابع مشابه
Unit Covering in Color-Spanning Set Model
In this paper, we consider two new variants of the unit covering problem in color-spanning set model: Given a set of n points in d-dimensional plane colored with m colors, the MinCSBC problem is to select m points of different colors minimizing the minimum number of unit balls needed to cover them. Similarly, the MaxCSBC problem is to choose one point of each color to maximize the minimum numbe...
متن کاملCovering Segments with Unit Squares
We study several variations of line segment covering problem with axis-parallel unit squares in IR. A set S of n line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at least one end-point of each segment. The variations depend on the orientation and length of the input segments. We prove some of these problems to be NP-complete, and give...
متن کاملOnline unit covering in L2
Given a set of points P in the plane, the classic Unit Covering (UC) problem asks to compute the minimum number of unit disks (possibly intersecting) required to cover the points in P , along with a placement of the disks. In this paper, we study an online version of UC in L2, which we call as Online Unit Covering (OUC) in L2, or, simply Online Unit Covering (OUC). In OUC, the points arrive onl...
متن کاملCovering Random Points in a Unit Disk
Let D be the punctured unit disk. It is easy to see that no pair x, y in D can cover D in the sense that D cannot be contained in the union of the unit disks centred at x and y. With this fact in mind, let Vn = {X1, X2, . . . , Xn}, where X1, X2, . . . are random points sampled independently from a uniform distribution on D. We prove that, with asymptotic probability one, there are two points i...
متن کاملCovering Points by Isothetic Unit Squares
Given a set P of n points in R, we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersecting (having empty common zone) such that they together cover maximum number of points. The time and space complexities of the proposed algorithm for this problem are both O(n). We also study the problem of computing k di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS Computational Biology
سال: 2019
ISSN: 1553-7358
DOI: 10.1371/journal.pcbi.1007563